Sufficiency and Duality in Multiobjective Programming with Generalized (f, Ρ)-convexity
نویسنده
چکیده
A multiobjective nonlinear programming problem is considered. Sufficiency theorems are derived for efficient and properly efficient solutions under generalized (F, ρ)-convexity assumptions. Weak, strong and strict converse duality theorems are established for a general Mond–Weir type dual relating properly efficient solutions of the primal and dual problems.
منابع مشابه
Sufficiency and duality in multiobjective fractional programming problems involving generalized type I functions
*Correspondence: [email protected] Chung-Jen Junior College of Nursing, Health Sciences and Management, Dalin, 62241, Taiwan Abstract In this paper, we establish sufficient optimality conditions for the (weak) efficiency to multiobjective fractional programming problems involving generalized (F,α,ρ ,d)-V-type I functions. Using the optimality conditions, we also investigate a parametric-type dua...
متن کاملSufficiency and Duality in Multiobjective Programming under Generalized Type I Functions
In this paper, new classes of generalized (F,α,ρ, d)-V -type I functions are introduced for differentiable multiobjective programming problems. Based upon these generalized convex functions, sufficient optimality conditions are established. Weak, strong and strict converse duality theorems are also derived for Wolfe and Mond-Weir type multiobjective dual programs.
متن کاملMixed type duality for multiobjective variational problems with generalized (F,ρ)-convexity
A mixed type dual for multiobjective variational problems is formulated. Several duality theorems are established relating properly efficient solutions of the primal and dual variational problems under generalized (F,ρ)-convexity. Static mixed type dual multiobjective problems are particular cases of these problems. 2004 Elsevier Inc. All rights reserved.
متن کاملSecond Order Duality in Multiobjective Programming
A nonlinear multiobjective programming problem is considered. Weak, strong and strict converse duality theorems are established under generalized second order (F, α, ρ, d)-convexity for second order Mangasarian type and general Mond-Weir type vector duals.
متن کاملNecessary Optimality and Duality for Multiobjective Semi-infinite Programming
The aim of this paper is to deal with a class of multiobjective semi-infinite programming problem. For such problem, several necessary optimality conditions are established and proved using the powerful tool of K − subdifferential and the generalized convexity namely generalized uniform ( , , , ) K F d α ρ − − convexity. We also formulate the Wolf type dual models for the semi-infinite programm...
متن کامل